Maximally complex simple attractors.

نویسنده

  • J C Sprott
چکیده

A relatively small number of mathematically simple maps and flows are routinely used as examples of low-dimensional chaos. These systems typically have a number of parameters that are chosen for historical or other reasons. This paper addresses the question of whether a different choice of these parameters can produce strange attractors that are significantly more chaotic (larger Lyapunov exponent) or more complex (higher dimension) than those typically used in such studies. It reports numerical results in which the parameters are adjusted to give either the largest Lyapunov exponent or the largest Kaplan-Yorke dimension. The characteristics of the resulting attractors are displayed and discussed.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Attractors in continuous and Boolean networks.

We study the stable attractors of a class of continuous dynamical systems that may be idealized as networks of Boolean elements, with the goal of determining which Boolean attractors, if any, are good approximations of the attractors of generic continuous systems. We investigate the dynamics in simple rings and rings with one additional self-input. An analysis of switching characteristics and p...

متن کامل

NOVEL REAGENTS FOR CREATINE KINASE

The purpose of this investigation was to develop a simple colorimetric method for creatine kinase (CK). The new method is based on the reaction of creatine, formed enzymatically from creatine phosphate and ADP, with different glyoxal compounds. Hydrated glyoxals, such as para-nitrophenyl, 2-thiophene, 4- biphenyl, 4, 4' -biphenyl,α-naphthyl, β-naphthyl, para-chlorophenyl, and styryl were...

متن کامل

LU TP 03-35 Superpolynomial Growth in the Number of Attractors in Kauffman Networks∗∗∗

The Kauffman model describes a particularly simple class of random Boolean networks. Despite the simplicity of the model, it exhibits complex behavior and has been suggested as a model for real world network problems. This work is based on an earlier paper where we introduced a novel approach to analyzing attractors in random Boolean networks. Applying this approach to Kauffman networks, we pro...

متن کامل

The Number of Attractors in Kauffman Networks

The Kauffman model describes a particularly simple class of random Boolean networks. Despite the simplicity of the model, it exhibits complex behavior and has been suggested as a model for real world network problems. We introduce a novel approach to analyzing attractors in random Boolean networks, and applying it to Kauffman networks we prove that the average number of attractors grows faster ...

متن کامل

Superpolynomial growth in the number of attractors in Kauffman networks.

The Kauffman model describes a particularly simple class of random Boolean networks. Despite the simplicity of the model, it exhibits complex behavior and has been suggested as a model for real world network problems. We introduce a novel approach to analyzing attractors in random Boolean networks, and applying it to Kauffman networks we prove that the average number of attractors grows faster ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Chaos

دوره 17 3  شماره 

صفحات  -

تاریخ انتشار 2007